State Transitions modeled as Re nements

نویسنده

  • Philipp W. Kutter
چکیده

We are going to show how state transitions can be modeled in the framework of algebraic speci cations. We use the algebraic speci cation, composition, and re nement framework provided by the Specware tool [28, 29] and Evolving Algebras [10] as a general framework for transition systems. Numerous case studies show that evolving algebras are well suited to model large and complex reactive and concurrent systems [1, 7, 5, 6, 15, 16, 17, 22, 21]. We show how evolving algebras can be embedded in Specware, and how Specware supports reasoning about Hoare triples [20]. Although Evolving Algebras are based on onesorted signatures we use for simplicity many sorted signatures for both algebraic speci cation and Evolving Algebras. We do not address the problem how one-sorted Evolving Algebras are translated to many-sorted ones [34]. The paper is structured as follows. In the second section we give the main ideas, and in the last section we draw conclusions and indicate further work. We assume familiarity of the reader with both Specware and Evolving Algebras. A selfcontained and less technical version of this ideas will be given in [26].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Re nement - based Planning As Satis ability

It has been shown recently that planning problems are easier to solve when they are cast as model nding problems. Some schemes for automated generation of the encodings of the planning problems in propositional logic have been designed. However these schemes lack several of the re nements that traditional split & prune type planners do. We show that it is possible to transfer these re nements i...

متن کامل

Reenement-based Planning as Satissability Result(a 1 a 2 a 3 :::a I I ), Denotes the Situation Prevailing

It has been shown recently that planning problems are easier to solve when they are cast as model nd ing problems Some schemes for automated gener ation of the encodings of the planning problems in propositional logic have been designed However these schemes lack several of the re nements that traditional split prune type planners do We show that it is possible to transfer these re nements into...

متن کامل

Distributed, Play-Based Coordination for Robot Teams in Dynamic Environments

We present re nements to our previous work on team communication and multi-robot world modeling in the RoboCup legged league. These re nements put high priority on the communication of task-relevant data. We also build upon past results within the simulation and the small-size leagues and contribute a distributed, play-based role assignment algorithm. This algorithm allows the robots to autonom...

متن کامل

Higher Order Functional Logic Programming A Systematic Development

We develop an e ective model for higher order functional logic programming by re ning higher order narrowing calculi The re nements reduce the high degree of non determinism in narrowing calculi utilizing properties of functional logic programs These include convergent and left linear rewrite rules All re nements can be combined to a narrowing strategy which generalizes call by need as in funct...

متن کامل

Mixin Layers: An Object-Oriented Implementation Technique for Re nements and Collaboration-Based Designs

A \re nement" is a functionality addition to a software project that can a ect multiple dispersed implementation entities (functions, classes, etc.). In this paper, we examine large-scale re nements in terms of a fundamental object-oriented technique called collaboration-based design. We explain how collaborations can be expressed in existing programming languages or be supported with new langu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996